Search for: All records

Accurate modeling of the response of molecular systems to an external electromagnetic field is challenging on classical computers, especially in the regime of strong electronic correlation. In this article, we develop a quantum linear response (qLR) theory to calculate molecular response properties on near-term quantum computers. Inspired by the recently developed variants of the quantum counterpart of equation of motion (qEOM) theory, the qLR formalism employs “killer condition” satisfying excitation operator manifolds that offer a number of theoretical advantages along with reduced quantum resource requirements. We also used the qEOM framework in this work to calculate the state-specific response properties. Further, through noiseless quantum simulations, we show that response properties calculated using the qLR approach are more accurate than the ones obtained from the classical coupled-cluster-based linear response models due to the improved quality of the ground-state wave function obtained using the ADAPT-VQE algorithm. 

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA. 

We present a new hybrid quantum algorithm to estimate molecular excited and charged states on near-term quantum computers following any VQE-based ground state estimation.